Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms
نویسندگان
چکیده
Abstract Preserving the “mental map” is a major goal of interactive graph drawing algorithms. Several models have been proposed for formalizing the notion of mental map. Additional work needs to be done to formulate and validate “difference” metrics which can be used in practice. This paper introduces a framework for defining and validating metrics to measure the difference between two drawings of the same graph, and gives a preliminary experimental analysis of several simple metrics.
منابع مشابه
Algorithms for Incremental Orthogonal Graph Drawing in Three Dimensions
We present two algorithms for orthogonal graph drawing in three dimensional space. For a graph with n vertices of maximum degree six, the 3-D drawing is produced in linear time, has volume at most 4.63n and has at most three bends per edge. If the degree of the graph is arbitrary, the vertices are represented by solid 3-D boxes whose surface is proportional to their degree. The produced drawing...
متن کاملDynamic Graph Drawing of Sequences of Orthogonal and Hierarchical Graphs
In this paper we introduce two novel algorithms for drawing sequences of orthogonal and hierarchical graphs while preserving the mental map. Both algorithms can be parameterized to trade layout quality for dynamic stability. In particular, we had to develop new metrics which work upon the intermediate results of layout phases. We discuss some properties of the resulting animations by means of e...
متن کاملThe Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing
In this paper, we study orthogonal graph drawings from a practical point of view. Most previously existing algorithms restricted the attention to graphs of maximum degree four. Here we study orthogonal drawing algorithms that work for any input graph, and discuss diierent models for such drawings. Then we introduce the three-phase method, a generic technique to create high-degree orthogonal dra...
متن کاملIncremental Orthogonal Graph Drawing in Three Dimensions
We present, two algorithms for orthogonal graph drawing in three dimensional space° For graphs of maximum degree six~ the 3-D drawing is produced in linear time, has volume at most 4.66n ~ and each edge has at most three bends. If the degree of the graph is arbitrary, the vertices are represented by solid 3-D boxes whose surface is proportional to their degree. The produced drawing has two bend...
متن کاملInteractive Orthogonal Graph Drawing
Many applications require human interaction during the design process. The user is given the ability to alter the graph as the design progresses. Interactive Graph Drawing allows the user to dynamically interact with the drawing. In this paper we discuss features that are essential for an interactive orthogonal graph drawing system. We also describe some possible interactive drawing scenaria, p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998